Factored Facade Acquisition using Symmetric Line Arrangements

نویسندگان

  • Duygu Ceylan
  • Niloy J. Mitra
  • Hao Li
  • Thibaut Weise
  • Mark Pauly
چکیده

We introduce a novel framework for image-based 3D reconstruction of urban buildings based on symmetry priors. Starting from image-level edges, we generate a sparse and approximate set of consistent 3D lines. These lines are then used to simultaneously detect symmetric line arrangements while refining the estimated 3D model. Operating both on 2D image data and intermediate 3D feature representations, we perform iterative feature consolidation and effective outlier pruning, thus eliminating reconstruction artifacts arising from ambiguous or wrong stereo matches. We exploit non-local coherence of symmetric elements to generate precise model reconstructions, even in the presence of a significant amount of outlier image-edges arising from reflections, shadows, outlier objects, etc. We evaluate our algorithm on several challenging test scenarios, both synthetic and real. Beyond reconstruction, the extracted symmetry patterns are useful towards interactive and intuitive model manipulations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variation-Factored Encoding of Facade Images

Urban facades contain large-scale repetitions in the form of windows, doors, etc. Such elements often are in different configurations (e.g., open or closed) obscuring their regular arrangements to any direct low-level pixel matching based repetition detection. We propose a variation-factored representation for facade images by progressively favoring larger repeated structures while allowing rel...

متن کامل

Inductively Factored Signed-graphic Arrangements of Hyperplanes

In 1994, Edelman and Reiner characterized free and supersolvable hyperplane arrangements in the restricted interval [An−1, Bn]. In this paper, we give a characterization of inductively factored arrangements in this interval, and show that the same characterization also describes factored arrangements in this interval. These results use the compact notation of signed graphs introduced by Zaslavsky.

متن کامل

Nice Reflection Arrangements

The aim of this note is a classification of all nice and all inductively factored reflection arrangements. It turns out that apart from the supersolvable instances only the monomial groups G(r, r, 3) for r > 3 give rise to nice reflection arrangements. As a consequence of this and of the classification of all inductively free reflection arrangements from Hoge and Röhrle (2015) we deduce that th...

متن کامل

Interactive Facades Analysis and Synthesis of Semi-Regular Facades

Urban facades regularly contain interesting variations due to allowed deformations of repeated elements (e.g., windows in different open or close positions) posing challenges to state-of-the-art facade analysis algorithms. We propose a semi-automatic framework to recover both repetition patterns of the elements and their individual deformation parameters to produce a factored facade representat...

متن کامل

Nice Restrictions of Reflection Arrangements

In [5], Hoge and the second author classified all nice and all inductively factored reflection arrangements. In this note we extend this classification by determining all nice and all inductively factored restrictions of reflection arrangements.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2012